String Regularities with Don't Cares

نویسندگان

  • Costas S. Iliopoulos
  • Manal Mohamed
  • Laurent Mouchard
  • Katerina Perdikuri
  • William F. Smyth
  • Athanasios K. Tsakalidis
چکیده

London WC2R 2LS, England f si,manalg d s.k l.a .uk 2 Department of Vegetal Physiology ABISS, Universit e de Rouen, 76821 Mont Saint Aignan Cedex, Fran e Laurent.Mou hard univ-rouen.fr 3 Computer Te hnology Institute, Patras, Gree e perdikur eid.upatras.gr, tsak ti.gr 4 Algorithms Resear h Group, Department of Computing & Software, M Master University, Hamilton, Ontario, Canada L8S 4K1 and S hool of Computing, Curtin University, Perth WA 6845, Australia

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate String Matching with Variable Length Don ' t Care

Searching for DNA or amino acid sequences similar to a given pattern string is very important in molecular biology. In fact, a lot of programs and algorithms have been developed. Most of them are based on alignment of strings or approximate string matching. However, they do not seem to be adequate in some cases. For example, the DNA pattern TATA (known as TATA box) is a common promoter that oft...

متن کامل

On pattern matching with k mismatches and few don't cares

We consider the problem of pattern matching with k mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern P of length m and a text T of length n, we want to find all occurrences of P in T that have no more than k mismatches. The pattern can have don't care characters, which match any character. Without don't cares, the best known algorith...

متن کامل

Simple deterministic wildcard matching

We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our algorithm takes O(n logm) time for a text of length n and a pattern of length m and in our view the algorithm is conceptually simpler than previous a...

متن کامل

Don't cares in synthesis: theoretical pitfalls and practical solutions

E ective use of don't cares requires solving several theoretical and practical problems. The theoretical problems are caused by a need to have all tools in a methodology use a consistent semantics of don't cares, so as to guarantee correctness of the nal implementation. Several common meanings of \don't care" will be considered and their respective conditions for design correctness will be deri...

متن کامل

Self-normalised Distance with Don't Cares

Self-normalised distance with don't cares Slide 1

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002